On some matrix inequalities
نویسنده
چکیده
The arithmetic-geometric mean inequality for singular values due to Bhatia and Kittaneh says that 2sj(AB ∗) ≤ sj(A∗A + B∗B), j = 1, 2, . . . for any matrices A,B. We first give new proofs of this inequality and its equivalent form. Then we use it to prove the following trace inequality: Let A0 be a positive definite matrix and A1, . . . , Ak be positive semidefinite matrices. Then tr k ∑
منابع مشابه
Some inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm
Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...
متن کاملFurther inequalities for operator space numerical radius on 2*2 operator matrices
We present some inequalities for operator space numerical radius of $2times 2$ block matrices on the matrix space $mathcal{M}_n(X)$, when $X$ is a numerical radius operator space. These inequalities contain some upper and lower bounds for operator space numerical radius.
متن کاملSingular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملA note on the Young type inequalities
In this paper, we present some refinements of the famous Young type inequality. As application of our result, we obtain some matrix inequalities for the Hilbert-Schmidt norm and the trace norm. The results obtained in this paper can be viewed as refinement of the derived results by H. Kai [Young type inequalities for matrices, J. Ea...
متن کاملBounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملOn the solving of matrix equation of Sylvester type
A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...
متن کامل